Computational bounds for elevator control policies by large scale linear programming
نویسندگان
چکیده
منابع مشابه
Computational Methods for Large-Scale Dynamic Programming
Description: This course offers an introduction to the methodology of large-scale dynamic programming, with emphasis on computational methods and applications. The objective is to provide students in the areas of operations management, finance and economics with working knowledge of the dynamic programming methodology and state-of-the-art approaches for dealing with the curse of methodology. By...
متن کاملBounds for Unrestricted Codes , by Linear Programming
The paper describes a problem of linear programming associated with distance properties of unrestricted codes. As a solution to the problem, one obtains an .upper bound for the number of words in codes having a prescribed set of distances. 1. Introduetion Important information about a code is contained in its Hamming distance distribution, defined as follows: for a q-ary code C of length n, it ...
متن کاملComputational Schemes for Large-Scale Problems in Extended Linear-Quadratic Programming
Numerical approaches are developed for solving large-scale problems of extended linear-quadratic programming that exhibit Lagrangian separability in both primal and dual variables simultaneously. Such problems are kin to large-scale linear complemen-tarity models as derived from applications of variational inequalities, and they arise from general models in multistage stochastic programming and...
متن کاملBounds on System Reliability by Linear Programming
Bounds on system probability in terms of marginal or joint component probabilities are of interest when exact solutions cannot be obtained. Currently, bounding formulas employing unicomponent probabilities are available for series and parallel systems, and formulas employing biand higher-order component probabilities are available for series systems. No theoretical formulas exist for general sy...
متن کاملAdvances in interior point methods for large-scale linear programming
This research studies two computational techniques that improve the practical performance of existing implementations of interior point methods for linear programming. Both are based on the concept of symmetric neighbourhood as the driving tool for the analysis of the good performance of some practical algorithms. The symmetric neighbourhood adds explicit upper bounds on the complementarity pai...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Mathematical Methods of Operations Research
سال: 2013
ISSN: 1432-2994,1432-5217
DOI: 10.1007/s00186-013-0454-5